منابع مشابه
On the approximability of location and network design problems
This thesis investigates the approximability of several NP-hard location and network design problems. We present polynomial time approximation algorithms with a performance guarantee on the worst-case quality of the output solution. We also establish lower-bound results (non-approximability results) which show that the performances of our algorithms are essentially the best unless P NP or NP DT...
متن کاملA ROBUST OPTIMIZATION MODEL FOR BLOOD SUPPLY CHAIN NETWORK DESIGN
The eternal need for humans' blood as a critical commodity makes the healthcare systems attempt to provide efficient blood supply chains (BSCs) by which the requirements are satisfied at the maximum level. To have an efficient supply of blood, an appropriate planning for blood supply chain is a challenge which requires more attention. In this paper, we address a mixed integer linear programming...
متن کاملRobust Network Design
Robust network design takes the very successful framework of robust optimization and applies it to the area of network design, motivated by applications in communication networks. The main premise is that demands across the network are not fixed, but are variable or uncertain. However, they are known to fall within a prescribed uncertainty set. Our solution must have sufficient capacity to rout...
متن کاملRobust network design
A crucial assumption in many network design problems is that of knowing the traffic demands in advance. Unfortunately, measuring and predicting traffic demands are difficult problems. Moreover, often communication patterns change over time, and therefore we are not given a single static traffic demand, but instead a set of non-simultaneous traffic demands. The network should be able to support ...
متن کاملApproximability of the robust representatives selection problem
In this paper new complexity and approximation results on the robust versions of the representatives selection problem, under the scenario uncertainty representation, are provided, which extend the results obtained in the recent papers by Dolgui and Kovalev (2012), and Deineko and Woeginger (2013). Namely, it is shown that if the number of scenarios is a part of input, then the min-max (regret)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 2014
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.2013.0620